Matching Points with Squares
نویسندگان
چکیده
Given a class C of geometric objects and a point set P , a C-matching of P is a set M = {C1, . . . , Ck} ⊆ C of elements of C such that each Ci contains exactly two elements of P and each element of P lies in at most one Ci. If all of the elements of P belong to some Ci, M is called a perfect matching. If, in addition, all of the elements of M are pairwise disjoint, we say that this matching M is strong. In this paper we study the existence and characteristics of C-matchings for point sets in the plane when C is the set of isothetic squares in the plane. A consequence of our results is a proof that the Delaunay triangulations for the L∞ metric and the L1 metric always admit a Hamiltonian path.
منابع مشابه
Least Squares Matching of 3d Surfaces
An algorithm for the least squares matching of overlapping 3D surfaces is presented. It estimates the transformation parameters of one or more fully 3D surfaces with respect to a template one, using the Generalized Gauss-Markoff model, minimizing the sum of squares of the Euclidean distances between the surfaces. This formulation gives the opportunity of matching arbitrarily oriented 3D surface...
متن کاملMatching Points with Rectangles and Squares
In this paper we deal with the following natural family of geometric matching problems. Given a class C of geometric objects and a point set P , a C-matching is a set M ⊆ C such that every C ∈ M contains exactly two elements of P . The matching is perfect if it covers every point, and strong if the objects do not intersect. We concentrate on matching points using axis-aligned squares and rectan...
متن کاملRecent Advances in Least Squares 3d Surface Matching
We present an algorithm for the least squares matching of overlapping 3D surfaces. It estimates the transformation parameters between two or more fully 3D surfaces, using the Generalized Gauss-Markoff model, minimizing the sum of squares of the Euclidean distances between the surfaces. This formulation gives the opportunity of matching arbitrarily oriented 3D surfaces simultaneously, without us...
متن کاملA New Matching Approach for Three-line Scanner Imagery
This paper deals with the automatic determination of conjugate points in multiple 3-line images of diierent resolution for the task of image orientation. A program for digital image matching was developed as part of the photogrammetric data processing chain in the context of the planned Mars'96 mission. The matching approach contains three phases: First, a few highly reliable conjugate points a...
متن کاملMulti Image Matching of Straight Lines with Geometric Constraints
Automatic multi image matching of linear features still remains to be a problem in both the photogrammetric and computer vision communities. Changes in the illumination conditions, camera position, and surrounding features challenge the automation of stereo matching of linear features. Moreover, linear feature matching becomes tougher when attempting to match linear features in more than two im...
متن کاملTriangulation Based Hierarchical Image Matching for Mars Dem Generation Using Moc Na Stereo Images
Traditional image matching approaches often fail in processing Mars Global Surveyor stereo images because of low contrast and insufficient number of features. Reliable and precision matching tool is needed for precise Mars digital elevation model generation. This paper presents a hierarchical image matching approach. First, a number of well identified points are manually measured in a stereo pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 41 شماره
صفحات -
تاریخ انتشار 2009